Standard Completeness for Extensions of MTL: An Automated Approach
نویسندگان
چکیده
We provide general conditions on hypersequent calculi that guarantee standard completeness for the formalized logics. These conditions are implemented in the PROLOG system AxiomCalc that takes as input any suitable axiomatic extension of Monoidal T-norm Logic MTL and outputs a hypersequent calculus for the logic and the result of the check. Our approach subsumes many existing results and allows for the computerized discovery of new fuzzy logics.
منابع مشابه
On strong standard completeness of MTLQ∗ expansions
Within the mathematical logic field, much effort has been devoted to prove completeness of different axiomatizations with respect to classes of algebras defined on the real unit interval [0, 1] (see for instance [1] and [2]), but in general, what has been mainly achieved are axiomatizations and results concerning fini-tary completeness, that is, for deductions from a finite number of premises. ...
متن کاملUniform proofs of standard completeness for extensions of first-order MTL
We provide general –and automatedly verifiable– sufficient conditions that ensure standard completeness for logics formalized Hilbert-style. Our approach subsumes many existing results and allows for the discovery of new fuzzy logics which extend first-order Monoidal T-norm Logic with propositional axioms.
متن کاملA note on the structure of PiMTL-chains and left-continuous cancellative T-norms
Recently the question of standard completeness of MTL and its extensions were deeply studied. Jenei and Montagna showed that MTL logic satisfies standard completeness theorem (see [6]). In [2], the authors studied standard completeness of ΠMTL which is an axiomatic extension of MTL logic where the conjunction is interpreted by a left-continuous cancellative t-norm. They showed that ΠMTL logic i...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملT-norm-based logics with an independent involutive negation
In this paper we investigate the addition of arbitrary independent involutive negations to t-norm based logics. We deal with several extensions of MTL and establish general completeness results. Indeed, we will show that, given any t-norm based logic satisfying some basic properties, its extension by means of an involutive negation preserves algebraic and (finite) strong standard completeness. ...
متن کامل